Query Answering in Peer-to-Peer Database Networks
نویسنده
چکیده
Peer-to-Peer (P2P) received significant attention from both industry and academia as a version of distributed computing lying between traditional distributed systems and the web. P2P found lots of its application in file sharing systems, distributed computations, instant messaging systems and so on. Database community investigates P2P as a new decentralized paradigm for distributed management of data, that gives sound advantages over existing database systems, and also raises some challenges for thorough research in this area. The main focuses of the current PhD thesis, supervised by Prof. Fausto Giunchiglia, are the study of the optimal balance of centralization vs. decentralization levels in a P2P database network necessary for efficient query answering; development of logical and physical architecture to support P2P databases; development of a query answering algorithm and a formal theory that would describe P2P databases as well as query answering and its quality; development of a prototype and conducting of the performance study in different initial settings.
منابع مشابه
Ontology-based Query Rewriting in Peer-to-Peer Networks
We describe an ontology-based approach to the problem of data interoperability, specifically focusing on the issue of query processing in a peer-to-peer (P2P) heterogeneous setting. In particular, we discuss the mechanisms for metadata representation, P2P ontology mapping, and query answering. Our contributions include PML, a P2P mapping language, RDFMS, a meta-ontology for mapping representati...
متن کاملControl in XML PDMS Query Answering
Peer data management system (PDMS) is a decentralized system, in which each peer is autonomous and has its own schema and database. With the help of pairwise schema mapping built between any two relevant peers, a query at one peer can be rewritten and broadcast to the whole PDMS. Then answers from multiple peers are returned to the querying peer. In our thesis, we exploit the access control iss...
متن کاملPrivacy Protected Query Processing on Spatial Networks
Privacy Protected spatial queries refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of Privacy Protected spatial query is of critical importance with the everincreasing deployment and use of mobile technologies. We show that Privacy Protected spatial query have certain unique characteristics that the traditional spatial query processing in central...
متن کاملSemantic Caching in Schema-Based P2P-Networks
In this paper, we present the use of semantic caching in the environment of schema-based super-peer networks. Different from traditional caching, semantic caching allows the answering of queries that are not in the cache directly. The challenge of answering the queries using the cache is reduced to the problem of answering queries using materialized views. For this purpose, we implemented the M...
متن کاملFlexible Intensional Query-Answering for RDF Peer-to-Peer Systems
We consider the Peer-To-Peer (P2P) database systems with RDF ontologies and with the semantic characterization of P2P mappings based on logical views over local peer’s ontology. Such kind of virtual-predicate based mappings needs an embedding of RDF ontologies into a predicate first-order logic, or at some of its sublanguages as, for example, logic programs for deductive databases. We consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003